Mapping properties of log log g' (z)

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic behavior of discrete holomorphic maps z and log(z)

It is shown that discrete analogs of z and log(z), defined via particular “integrable” circle patterns, have the same asymptotic behavior as their smooth counterparts. These discrete maps are described in terms of special solutions of discrete Painlevé-II equations, asymptotics of these solutions providing the behaviour of discrete z and log(z) at infinity.

متن کامل

StUSPACE(log n) <= DSPACE(log²n / log log n)

We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.

متن کامل

Binocular tracking using log polar mapping

This paper describes a new binocular tracking method using Log Polar Mapping (LPM) which approximately represents the mapping of the retina into the visual cortex in primate vision. Using LPM makes it possible not only to obtain both a high central resolution and a wide eld of view, but also to signi cantly reduce processing image data. In this paper, LPM is performed in software by lookup tabl...

متن کامل

An Introduction to the Log-Polar Mapping

One interesting feature of the human visual system is the topological transformation of the retinal image into its cortical projection. The excitation of the cortex can be approximated by a log-polar mapping of the eye’s retinal image. In this tutorial paper we describe the log-polar mapping and its main properties.

متن کامل

The log-log LMS algorithm

This paper describes a new variant of the least-mean-squares (LMS) algorithm, with low computational complexity, for updating an adaptive lter. The reduction in complexity is obtained by using values of the input data and the output error, quantized to the nearest power of two, to compute the gradient. This eliminates the need for multipliers or shifters in the algorithm's update section. The q...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Colloquium Mathematicum

سال: 1975

ISSN: 0010-1354,1730-6302

DOI: 10.4064/cm-32-2-267-276